|
Ray Solomonoff (July 25, 1926 – December 7, 2009)〔http://agi-conf.org/2010/2009/12/12/ray-solomonoff-1926-2009〕 was the inventor of algorithmic probability,〔(detailed description of Algorithmic Probability in Scholarpedia )〕 his General Theory of Inductive Inference (also known as Universal Inductive Inference),〔Samuel Rathmanner and Marcus Hutter. A philosophical treatise of universal induction. Entropy, 13(6):1076–1136, 2011〕 and was a founder of algorithmic information theory.〔Vitanyi, P. "(Obituary: Ray Solomonoff, Founding Father of Algorithmic Information Theory" )〕 He was an originator of the branch of artificial intelligence based on machine learning, prediction and probability. He circulated the first report on non-semantic machine learning in 1956.〔"An Inductive Inference Machine", Dartmouth College, N.H., version of Aug. 14, 1956. ((pdf scanned copy of the original) )〕 Solomonoff first described algorithmic probability in 1960, publishing the theorem that launched Kolmogorov complexity and algorithmic information theory. He first described these results at a Conference at Caltech in 1960,〔Paper from conference on "Cerebral Systems and Computers", California Institute of Technology, Feb 8-11, 1960, cited in "A Formal Theory of Inductive Inference, Part 1, 1964, p. 1〕 and in a report, Feb. 1960, "A Preliminary Report on a General Theory of Inductive Inference."〔Solomonoff, R., "(A Preliminary Report on a General Theory of Inductive Inference )", Report V-131, Zator Co., Cambridge, Ma. Feb 4, 1960, (revision ), Nov., 1960.〕 He clarified these ideas more fully in his 1964 publications, "A Formal Theory of Inductive Inference," Part I〔Solomonoff, R., "(A Formal Theory of Inductive Inference, Part I )" ''Information and Control'', Vol 7, No. 1 pp 1-22, March 1964.〕 and Part II.〔Solomonoff, R., "(A Formal Theory of Inductive Inference, Part II )" ''Information and Control'', Vol 7, No. 2 pp 224-254, June 1964.〕 Algorithmic probability is a mathematically formalized combination of Occam's razor,〔Induction: From Kolmogorov and Solomonoff to De Finetti and Back to Kolmogorov JJ McCall - Metroeconomica, 2004 - Wiley Online Library.〕〔Foundations of Occam's razor and parsimony in learning from ricoh.com D Stork - NIPS 2001 Workshop, 2001〕〔Occam's razor as a formal basis for a physical theory from arxiv.org AN Soklakov - Foundations of Physics Letters, 2002 - Springer〕〔Beyond the Turing Test from uclm.es J HERNANDEZ-ORALLO - Journal of Logic, Language, and …, 2000 - dsi.uclm.es〕 and the Principle of Multiple Explanations.〔Ming Li and Paul Vitanyi, ''An Introduction to Kolmogorov Complexity and Its Applications.'' Springer-Verlag, N.Y., 2008p 339 ff.〕 It is a machine independent method of assigning a probability value to each hypothesis (algorithm/program) that explains a given observation, with the simplest hypothesis (the shortest program) having the highest probability and the increasingly complex hypotheses receiving increasingly small probabilities. Solomonoff founded the theory of universal inductive inference, which is based on solid philosophical foundations〔 and has its root in Kolmogorov complexity and algorithmic information theory. The theory uses algorithmic probability in a Bayesian framework. The universal prior is taken over the class of all computable measures; no hypothesis will have a zero probability. This enables Bayes' rule (of causation) to be used to predict the most likely next event in a series of events.〔 Although he is best known for algorithmic probability and his general theory of inductive inference, he made many other important discoveries throughout his life, most of them directed toward his goal in artificial intelligence: to develop a machine that could solve hard problems using probabilistic methods. == Life history through 1964 == Ray Solomonoff was born on July 25, 1926, in Cleveland, Ohio, son of Jewish Russian immigrants Phillip Julius and Sarah Mashman Solomonoff. He attended Glenville High School, graduating in 1944. In 1944 he joined the United States Navy as Instructor in Electronics. From 1947-1951 he attended the University of Chicago, studying under Professors such as Rudolf Carnap and Enrico Fermi, and graduated with an M.S. in Physics in 1951. From his earliest years he was motivated by the pure joy of mathematical discovery and by the desire to explore where no one had gone before. At age of 16, in 1942, he began to search for a general method to solve mathematical problems. In 1952 he met Marvin Minsky, John McCarthy and others interested in machine intelligence. In 1956 Minsky and McCarthy and others organized the Dartmouth Summer Research Conference on Artificial Intelligence, where Ray was one of the original 10 invitees --- he, McCarthy, and Minsky were the only ones to stay all summer. It was for this group that Artificial Intelligence was first named as a science. Computers at the time could solve very specific mathematical problems, but not much else. Ray wanted to pursue a bigger question, how to make machines more generally intelligent, and how computers could use probability for this purpose. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Ray Solomonoff」の詳細全文を読む スポンサード リンク
|